Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
نویسندگان
چکیده
This paper presents an efficient algorithm for minimizing a certain class of submodular functions that arise in analysis of multiclass queueing systems. In particular, the algorithm can be used for testing whether a given multiclass M/M/1 system achieves a required average performance by an appropriate control policy. With the aid of the topological sweeping method for line arrangement, our algorithm runs in O(n) time, where n is the cardinality of the ground set. This is much faster than direct applications of general submodular function minimization algorithms.
منابع مشابه
Linear Optimization over a Polymatroid with Side Constraints – Scheduling Queues and Minimizing Submodular Functions
Two seemingly unrelated problems, scheduling a multiclass queueing system and minimizing a submodular function, share a rather deep connection via the polymatroid that is characterized by a submodular set function on the one hand and represents the performance polytope of the queueing system on the other hand. We first develop what we call a grouping algorithm that solves the queueing schedulin...
متن کاملSubmodular function minimization
A set function f defined on the subsets of a finite set V is said to be submodular if it satisfies f(X) + f(Y ) ≥ f(X ∪ Y ) + f(X ∩ Y ), ∀X, Y ⊆ V. Submodular functions are discrete analogues of convex functions. They arise in various branches of applied mathematics such as game theory, information theory, and queueing theory. Examples include the matroid rank functions, the cut capacity functi...
متن کاملA Submodular Function Minimization Algorithm Based on the Minimum-Norm Base∗
We consider an application of the minimum-norm-point algorithm to submodular function minimization. Although combinatorial polynomial algorithms for submodular function minimization (SFM) have recently been obtained, there still remain (open) problems of reducing the complexity of the SFM algorithms and of constructing a practically fast SFM algorithms. We show some possible approach to the pro...
متن کاملFluid Queueing Networks
We introduce a new method to investigate stability of work-conserving policies in multiclass queueing networks. The method decomposes feasible trajectories and uses linear programming to test stability. We show that this linear program is a necessary and sufficient condition for the stability of all work-conserving policies for multiclass fluid queueing networks with two stations. Furthermore, ...
متن کاملStability conditions for multiclass uid queueing networks
We introduce a new method to investigate stability of work-conserving policies in multiclass queueing networks. The method decomposes feasible trajectories and uses linear programming to test stability. We show that this linear program is a necessary and suucient condition for the stability of all work-conserving policies for multiclass uid queueing networks with two stations. Furthermore, we n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007